0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n130.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:13:24 CST 2018
0.00/0.21	% done 21 iterations in 0.006s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(binunionLsub, axiom,
0.00/0.21	  (binunionLsub <=> (![A,B]: subset(A,binunion(A,B))))).
0.00/0.21	tff('0', plain, ![X5, X6]: (subset(X5, binunion(X5, X6)) | ~ binunionLsub),
0.00/0.21	    inference('cnf', [status(esa)], [binunionLsub])).
0.00/0.21	tff(singletoninpowunion, conjecture,
0.00/0.21	  (subsetE =>
0.00/0.21	   (powersetsubset =>
0.00/0.21	    (binunionLsub =>
0.00/0.21	     (singletoninpowerset =>
0.00/0.21	      (![A,B,Xx]:
0.00/0.21	         (in(Xx,A) => in(setadjoin(Xx,emptyset),powerset(binunion(A,B)))))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (subsetE =>
0.00/0.21	     (powersetsubset =>
0.00/0.21	      (binunionLsub =>
0.00/0.21	       (singletoninpowerset =>
0.00/0.21	        (![A,B,Xx]:
0.00/0.21	           (in(Xx,A) => in(setadjoin(Xx,emptyset),powerset(binunion(A,B))))))))))).
0.00/0.21	tff('1', plain, binunionLsub, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain, ![X5, X6]: (subset(X5, binunion(X5, X6)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain, ![X5, X6]: subset(X5, binunion(X5, X6)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff(subsetE, axiom,
0.00/0.21	  (subsetE <=> (![A,B,Xx]: (subset(A,B) => (in(Xx,A) => in(Xx,B)))))).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, X2) | ~ subset(X1, X2) | ~ subsetE),
0.00/0.21	    inference('cnf', [status(esa)], [subsetE])).
0.00/0.21	tff('5', plain, subsetE, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, X2) | ~ subset(X1, X2) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.21	tff('7', plain,
0.00/0.21	    ![X0, X1, X2]: (~ subset(X1, X2) | in(X0, X2) | ~ in(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X0, X1, X2]: (~ $true | ~ in(X2, X1) | in(X2, binunion(X1, X0))),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '7'])).
0.00/0.21	tff('9', plain, ![X0, X1, X2]: (in(X2, binunion(X1, X0)) | ~ in(X2, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['8'])).
0.00/0.21	tff(singletoninpowerset, axiom,
0.00/0.21	  (singletoninpowerset <=>
0.00/0.21	   (![A,Xx]: (in(Xx,A) => in(setadjoin(Xx,emptyset),powerset(A)))))).
0.00/0.21	tff('10', plain,
0.00/0.21	    ![X7, X8]:
0.00/0.21	      (~ in(X7, X8)
0.00/0.21	       | in(setadjoin(X7, emptyset), powerset(X8))
0.00/0.21	       | ~ singletoninpowerset),
0.00/0.21	    inference('cnf', [status(esa)], [singletoninpowerset])).
0.00/0.21	tff('11', plain, singletoninpowerset,
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('12', plain,
0.00/0.21	    ![X7, X8]:
0.00/0.21	      (~ in(X7, X8) | in(setadjoin(X7, emptyset), powerset(X8)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['10', '11'])).
0.00/0.21	tff('13', plain,
0.00/0.21	    ![X7, X8]: (in(setadjoin(X7, emptyset), powerset(X8)) | ~ in(X7, X8)),
0.00/0.21	    inference('simplify', [status(thm)], ['12'])).
0.00/0.21	tff('14', plain,
0.00/0.21	    ~ in(setadjoin(sk_Xx2, emptyset), powerset(binunion(sk_A4, sk_B3))),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('15', plain, (~ $true | ~ in(sk_Xx2, binunion(sk_A4, sk_B3))),
0.00/0.21	    inference('sup-', [status(thm)], ['13', '14'])).
0.00/0.21	tff('16', plain, ~ in(sk_Xx2, binunion(sk_A4, sk_B3)),
0.00/0.21	    inference('simplify', [status(thm)], ['15'])).
0.00/0.21	tff('17', plain, (~ $true | ~ in(sk_Xx2, sk_A4)),
0.00/0.21	    inference('sup-', [status(thm)], ['9', '16'])).
0.00/0.21	tff('18', plain, in(sk_Xx2, sk_A4),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('19', plain, (~ $true | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['17', '18'])).
0.00/0.21	tff('20', plain, $false, inference('simplify', [status(thm)], ['19'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
